Rate stability and output rates in queueing networks with shared resources

Rate stability and output rates in queueing networks with shared resources

Motivated by a variety of applications in information and communication systems, we consider queueing networks in which the service rate at each of the individual nodes depends on the state of the entire system. The asymptotic behaviour of this type of networks is fundamentally different from classical queueing networks, where the service rate at each node is usually assumed to be independent o...

Queueing Networks with Shared Resources

All rights reserved. No part of this publication may be reproduced in any form or by any electronic or mechanical means (including photocopying, recording, or information storage and retrieval systems) without permission in writing from the author. CONTENTS Dankwoord i Contents iii 1 Introduction 1 1.

Optimal Allocation in a Queueing System with Shared Resources

In this paper, we study the problem of dynamic allocation of heterogeneous processors to parallel heterogeneous job traffic flows. Each traffic flow is a stationary ergodic random marked point process, with a parameter (traffic intensity rate) that depends on the job class. The service rates of the various job flows depend on both the job class and the processor class. This model captures the e...

Simulating layered queueing networks with passive resources

This paper describes an extension to Layered Queueing Networks (LQN), a form of an extended queueing network used to investigate performance problems, to model passive resources such as counting semaphores and buffers. Layered queueing networks can be constructed directly, or from UML design models which incorporate the MARTE profile, either directly or via the Core Scenario Model. Layered Queu...

Multi-Component Efficiency with Shared Resources in Commercial Banks